On Chooser-Picker positional games
نویسندگان
چکیده
Two new versions of the so-called Maker-Breaker Positional Games are defined by József Beck. In these variants Picker takes unselected pair of elements and Chooser keeps one of these elements and gives back the other to Picker. In the Picker-Chooser version Picker is Maker and Chooser is Breaker, while the roles are swapped in the Chooser-Picker version. It seems that both the Picker-Chooser and Chooser-Picker versions are not worse for Picker than the original Maker-Breaker versions. Here we give winning conditions for Picker in some Chooser-Picker games that extend the results of Beck.
منابع مشابه
On the Complexity of Chooser-picker Positional Games
Two new versions of the so-called Maker-Breaker Positional Games are defined by József Beck in [Combinatorica 22(2) (2002) 169–216]. He defines two players, Picker and Chooser. In each round, Picker takes a pair of elements not already selected and Chooser keeps one and returns the other to Picker. In the Picker-Chooser version Picker plays as Maker and Chooser plays as Breaker, while the roles...
متن کاملThe Picker-Chooser diameter game
Positional Games are played under several rules on the same hypergraph. We consider some intriguing connection among the outcome of the Maker-Breaker and the Picker-Chooser versions. The later ones were introduced by Beck in [5] and proved to be important in understanding Positional Games in general. Beck had the profound conjecture that playing on the same hypergraph, Picker has better chances...
متن کاملCournot and Bertrand Games
The author describes a series of matrix choice games illustrating monopoly, shared monopoly, Cournot, Bertrand, and Stackelberg behavior given either perfect complements or perfect substitutes. The games are created by using a spreadsheet to fill out a profit table given the choices of two players. One player selects the column, the other the row, and the table gives the profit of the row choos...
متن کاملManipulative Waiters with Probabilistic Intuition
For positive integers n and q and a monotone graph property A, we consider the two player, perfect information game WC(n, q,A), which is defined as follows. The game proceeds in rounds. In each round, the first player, called Waiter, offers the second player, called Client, q + 1 edges of the complete graph Kn which have not been offered previously. Client then chooses one of these edges which ...
متن کاملGames Where You Can Play Optimally Without Any Memory
Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, the most popular games in this context are parity games and their cousins (Rabin, Streett and Muller games). Recently however also games with other types of payments, like discounted or mean-payoff [5,6], previously used only in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009